Ramsey’s theorem for singletons and strong computable reducibility
نویسندگان
چکیده
منابع مشابه
Ramsey’s Theorem for Singletons and Strong Computable Reducibility
We answer a question posed by Hirschfeldt and Jockusch by showing that whenever k > `, Ramsey’s theorem for singletons and k-colorings, RTk, is not strongly computably reducible to the stable Ramsey’s theorem for `-colorings, SRT` . Our proof actually establishes the following considerably stronger fact: given k > `, there is a coloring c : ω → k such that for every stable coloring d : [ω]2 → `...
متن کاملComputable Reducibility for Cantor Space
We examine various versions of Borel reducibility on equivalence relations on the Cantor space 2ω , using reductions given by Turing functionals on the inputs A ∈ 2ω . In some versions, we vary the number of jumps of A which the functional is allowed to use. In others, we do not require the reduction to succeed for all elements of the Cantor space at once, but only when applied to arbitrary fin...
متن کاملComputable Fields and Weak Truth-Table Reducibility
For a computable field F , the splitting set SF of F is the set of polynomials with coefficients in F which factor over F , and the root set RF of F is the set of polynomials with coefficients in F which have a root in F . Results of Frohlich and Shepherdson in [3] imply that for a computable field F , the splitting set SF and the root set RF are Turing-equivalent. Much more recently, in [6], M...
متن کاملEnumeration Reducibility and Computable Structure Theory
In classical computability theory the main underlying structure is that of the natural numbers or equivalently a structure consisting of some constructive objects, such as words in a finite alphabet. In the 1960’s computability theorists saw it as a challenge to extend the notion of computable to arbitrary structure. The resulting subfield of computability theory is commonly referred to as comp...
متن کاملComputable Component-wise Reducibility | Egor Ianovski
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for Σ1, the ≤m relation on EXPTIME sets for Σ2 and the embeddability of computable subgroups of (Q,+) for Σ3. In all cases, the symmetric fragment of the preorder is complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2016
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/13315